Dynamic Scheduling in a Partially Fluid, Partially Lossy Queueing System

We consider a single server queueing system with two classes of jobs: eager jobs small sizes that require service to begin almost immediately upon arrival, and tolerant larger can wait for service. While blocking probability is the relevant performance metric class, class seeks minimize its mean sojourn time. In this article, we analyse each under dynamic scheduling policies, where both depends on instantaneous state system. This analysis carried out certain fluid limit, arrival rate are scaled infinity, holding offered load constant. Our characterizations reveal (dynamic) pseudo-conservation law ties standalone probabilities associated policies class. Furthermore, robust other specifics policies. also characterize Pareto frontier achievable region vectors same identify (two-parameter) Pareto-complete